Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
g(X) |
→ u(h(X),h(X),X) |
| 2: |
|
u(d,c(Y),X) |
→ k(Y) |
| 3: |
|
h(d) |
→ c(a) |
| 4: |
|
h(d) |
→ c(b) |
| 5: |
|
f(k(a),k(b),X) |
→ f(X,X,X) |
|
There are 3 dependency pairs:
|
| 6: |
|
G(X) |
→ U(h(X),h(X),X) |
| 7: |
|
G(X) |
→ H(X) |
| 8: |
|
F(k(a),k(b),X) |
→ F(X,X,X) |
|
The approximated dependency graph contains one SCC:
{8}.
-
Consider the SCC {8}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006